#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=200;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL n,k;
bool check(LL x){
    double sum=1.0*a[1];
    double ans=0;
    for(LL i=2;i<=n;i++){
        if(1.0*a[i]/sum>0.01*k){
            ans+=(a[i]-0.01*k*sum)/(0.01*k);
            sum+=(a[i]-0.01*k*sum)/(0.01*k);
        }
        sum+=a[i];
    }
    if(ans<=x) return true;
    else return false;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    cin>>n>>k;
    for(LL i=1;i<=n;i++){ cin>>a[i];}
    LL l=0;LL r=1e18;
    while(l<r){
        LL mid=(l+r)>>1;
        if(check(mid)) r=mid;
        else l=mid+1;
    }
    printf("%lld\n",l);
  }
return 0;
}
